Tootfinder

Former judge J. Michael Luttig with record of knowing what’s next predicts Trump Supreme Court verdict - Alternet.org
https://www.alternet.org/trump-luttig/

Conservative judge with record of knowing what’s next predicts Trump Supreme Court verdict
Former Judge J. Michael Luttig has been right on just about everything he predicted coming from the Supreme Court so far, MSNBC's Nicolle Wallace said. So, she wanted to know his predictions for the decision over Donald Trump's claim of presidential immunity. Trump's 2020 election case went befo...

@… I don’t believe it. Planes fly at an altitude of about 11km above the ground and counting vertically, so from such a distance to connect with one BTS is a challenge, and you are certainly not able to take communication with a thousand antennas as you said.

This https://arxiv.org/abs/2404.07568 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_mat…

Abundance theorem for minimal projective varieties satisfying Miyaoka's equality
In this paper, we solve the abundance conjecture for minimal projective klt varieties $X$ satisfying Miyaoka's equality $3c_2(X) = c_{1}(X)^{2}$. Specifically, we prove that the canonical divisor $K_{X}$ is semi-ample and the Kodaira dimension $κ(K_{X})$ is either $0$, $1$, or $2$. Moreover, according to the Kodaira dimension, we reveal the structure of the Iitaka fibration of $X$ up to quasi-étale covers. Additionally, we show similar results for projective klt varieties with nef anti-canoni…

Want to see what it would look like if you were a hamster in your own little space capsule coming down from orbit? Here’s a #VardaSpace video. After 7 min., you can see the satellite it dropped from. At 11 min. the atmospheric effects kick in, & at 13 min. you get a good sense of speed.

$(\Delta 1)$ Vertex Coloring in $O(n)$ Communication
Maxime Flin, Parth Mittal
https://arxiv.org/abs/2404.19081 https://arxiv.org/p…

$(Δ+ 1)$ Vertex Coloring in $O(n)$ Communication
We study the communication complexity of $(Δ+ 1)$ vertex coloring, where the edges of an $n$-vertex graph of maximum degree $Δ$ are partitioned between two players. We provide a randomized protocol which uses $O(n)$ bits of communication and ends with both players knowing the coloring. Combining this with a folklore $Ω(n)$ lower bound, this settles the randomized communication complexity of $(Δ+ 1)$-coloring up to constant factors.

Unified inverse correspondence for LE-logics
Alessandra Palmigiano, Mattia Panettiere
https://arxiv.org/abs/2405.01262 https://arxiv.…

Unified inverse correspondence for LE-logics
We generalize Kracht's theory of internal describability from classical modal logic to the family of all logics canonically associated with varieties of normal lattice expansions (LE algebras). We work in the purely algebraic setting of perfect LEs; the formulas playing the role of Kracht's formulas in this generalized setting pertain to a first order language whose atoms are special inequalities between terms of perfect algebras. Via duality, formulas in this language can be equivalently trans…

Want to see what it would look like if you were a hamster in your own little space capsule coming down from orbit? Here’s a #VardaSpace video. After 7 min., you can see the satellite it dropped from. At 11 min. the atmospheric effects kick in, & at 13 min. you get a good sense of speed.

This https://arxiv.org/abs/2205.00730 has been replaced.
link: https://scholar.google.com/scholar?q=a

Sharp bounds on the height of K-semistable Fano varieties I, the toric case
Inspired by Fujita's algebro-geometric result that complex projective space has maximal degree among all K-semistable complex Fano varieties, we conjecture that the height of a K-semistable metrized arithmetic Fano variety X of relative dimension n is maximal when X is the projective space over the integers, endowed with the Fubini-Study metric. Our main result establishes the conjecture for the canonical integral model of a toric Fano variety when n is less than or equal to 6 (the extension to…

$(\Delta 1)$ Vertex Coloring in $O(n)$ Communication
Maxime Flin, Parth Mittal
https://arxiv.org/abs/2404.19081 https://arxiv.org/p…

$(Δ+ 1)$ Vertex Coloring in $O(n)$ Communication
We study the communication complexity of $(Δ+ 1)$ vertex coloring, where the edges of an $n$-vertex graph of maximum degree $Δ$ are partitioned between two players. We provide a randomized protocol which uses $O(n)$ bits of communication and ends with both players knowing the coloring. Combining this with a folklore $Ω(n)$ lower bound, this settles the randomized communication complexity of $(Δ+ 1)$-coloring up to constant factors.

This https://arxiv.org/abs/2302.11642 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_mat…

The Isomorphism Problem for cominuscule Schubert Varieties
Cominuscule flag varieties generalize Grassmannians to other Lie types. Schubert varieties in cominuscule flag varieties are indexed by posets of roots labeled long/short. These labeled posets generalize Young diagrams. We prove that Schubert varieties in potentially different cominuscule flag varieties are isomorphic as varieties if and only if their corresponding labeled posets are isomorphic, generalizing the classification of Grassmannian Schubert varieties using Young diagrams by the last …